Quasi-Parity and Perfect Graphs
نویسنده
چکیده
In order to prove the Strong Perfect Graph Conjecture, the existence of a ”simple” property P holding for any minimal non-quasi-parity Berge graph G would really reduce the difficulty of the problem. We prove here that this property cannot be of type ”G is F-free”, where F is any fixed family of Berge graphs.
منابع مشابه
Recognizing Planar Strict Quasi-Parity Graphs
A graph is a strict-quasi parity (SQP) graph if every induced subgraph that is not a clique contains a pair of vertices with no odd chordless path between them (an``even pair''). We present an O n 3 algorithm for recognizing planar strict quasi-parity graphs, based on Wen-Lian Hsu's decomposition of planar (perfect) graphs and on the (non-algorithmic) characterization of planar minimal non-SQ...
متن کاملPerfectly orderable graphs are quasi-parity graphs: a short proof
%'c shw that perfectly orderabk grapk Sa are q&-parity graphs by exhibiting two &lodes which are not llinked by a chordless odd chain. This proof is short and simpler than the one given by H. Meynid. A graph G = (V, E) _ is called a quasi-~&y graph if for every A s X the induced subgraph GA is a clique or contains 2 nodes x, y which are riot linked by a (chordless) odd chain in G,+ Quasi-parity...
متن کاملOn Planar Quasi-Parity Graphs
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Hougardy conjectured that the minimal forbidden subgraphs for the class of SQP graphs are the odd chordless cycles, the complements of odd or even chordless cycles, and some line-graphs of bipartite graphs. Here we prove t...
متن کاملEven Pairs in Claw-Free Perfect Graphs
An even pair in a graph is a pair of non-adjacent vertices such that every chordless path between them has even length. A graph is called strict quasi-parity when every induced subgraph that is not a clique has an even pair, and it is called perfectly contractile when every induced subgraph can be turned into a clique through a sequence of even-pair contractions. In this paper we determine the ...
متن کاملBinary quasi-perfect linear codes from APN quadratic functions
A mapping f from F2m to itself is almost perfect nonlinear (APN) if its directional derivatives in nonzero directions are all 2-to-1. Let Cf be the binary linear code of length 2 − 1, whose parity check matrix has its j-th column [ π f(π) ] , where π is a primitive element in F2m and j = 0, 1, · · · , 2 − 2. For m ≥ 3 and any quadratic APN function f(x) = ∑m−1 i,j=0 ai,jx 2+2 , ai,j ∈ F2m , it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 54 شماره
صفحات -
تاریخ انتشار 1995